Automatic Focal Cortical Dysplasiav(FCD) detection by Magnetic Resonance Image (MRI)

Nowadays, approximately 50 million people are suffering from epilepsy all over the world, of whom 30% have Focal Cortical Dysplasia (FCD), a malformation that occurs during brain cortical development. In clinical treatments, FCD lesions often have to be removed by resective surgery. Magnetic Resonance Imaging (MRI) is the most important clinical tool for identifying FCD lesions, and has allowed the diagnostic detection of FCD lesions in an increasing number of patients, leading to increased rates of successful resective surgery. However, detection of FCD lesions is still a challenging task because of various factors such as extremely subtle FCD malformations, complex convolutions of human cerebral cortex and partial volume effect due to imaging. Previous works develop MRI features of FCD lesions to highlight FCD regions. However, these MRI features also exist in Healthy Controls. We developed a new MRI features of FCD lesions, and use a multi-feature based method to perform automatic FCD detection. As a results, we improve the similarity index than the previous method. Sensitivity and specificity are also improved by proposed work. The proposed work can be a useful clinical tool to assist FCD detection

A computational efficient external energy for active contour segmentation using edge propagation

Active contours or snakes are widely used for segmentation and tracking. We propose a new active contour model, which converges reliably even when the initialization is far from the object of interest. The proposed segmentation technique uses an external energy function where the energy slowly decreases in the vicinity of an edge. This new energy function is calculated using an efficient dual scan line algorithm. The proposed energy function is tested on computational speed, its effect on the convergence speed of the active contour and the segmentation result. The proposed method gets similar segmentation results as the gradient vector flow active contours, but the energy function needs much less time to calculate

Computational efficient segmentation of cell nuclei in 2D and 3D fluorescent micrographs

This paper proposes a new segmentation technique developed for the segmentation of cell nuclei in both 2D and 3D fluorescent micrographs. The proposed method can deal with both blurred edges as with touching nuclei. Using a dual scan line algorithm its both memory as computational efficient, making it interesting for the analysis of images coming from high throughput systems or the analysis of 3D microscopic images. Experiments show good results, i.e. recall of over 0.98

Wavelet based joint denoising of depth and luminance images

In this paper we present a new method for joint denoising of depth and luminance images produced by time-of-flight camera. Here we assume that the sequence does not contain outlier points which can be present in the depth images. Our method first performs estimation of noise and signal covariance matrices and then performs vector denoising. Two versions of the algorithm are presented, depending on the method used for the classification of the image contexts. Denoising results are compared with the ground truth images obtained by averaging of the multiple frames of the still scene

Image segmentation with adaptive region growing based on a polynomial surface model

A new method for segmenting intensity images into smooth surface segments is presented. The main idea is to divide the image into flat, planar, convex, concave, and saddle patches that coincide as well as possible with meaningful object features in the image. Therefore, we propose an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L∞ fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main contribution is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way. As a result, the surface segments corresponding to meaningful object features and the contours separating the surface segments coincide with real-image object edges. Moreover, the curvature-based surface shape information facilitates many tasks in image analysis, such as object recognition performed on the polynomial representation. The polynomial representation provides good image approximation while preserving all the necessary details of the objects in the reconstructed images. The method outperforms existing techniques when segmenting images of objects with diffuse reflecting surfaces

PhD forum: extracting similar patterns of behavior with a network of binary sensors

The aging population is continuously growing and this results in increasing the demands for using technologies to help to manage the rapidly growing sector of the elderly population. To contribute in this effort, we propose a method that can find similar patterns of behavior for extended durations. Our method uses motion sensors as a privacy-aware alternative to cameras. We compute three initial parameters to extract similar patterns of behavior: (1) movement in spot; (2) movement between rooms; and (3) movement within rooms. The three parameters demonstrate good similarity indicators for finding patterns of behavior between each pair of days

Neighbourhood-consensus message passing and its potentials in image processing applications

In this paper, a novel algorithm for inference in Markov Random Fields (MRFs) is presented. Its goal is to find approximate maximum a posteriori estimates in a simple manner by combining neighbourhood influence of iterated conditional modes (ICM) and message passing of loopy belief propagation (LBP). We call the proposed method neighbourhood-consensus message passing because a single joint message is sent from the specified neighbourhood to the central node. The message, as a function of beliefs, represents the agreement of all nodes within the neighbourhood regarding the labels of the central node. This way we are able to overcome the disadvantages of reference algorithms, ICM and LBP. On one hand, more information is propagated in comparison with ICM, while on the other hand, the huge amount of pairwise interactions is avoided in comparison with LBP by working with neighbourhoods. The idea is related to the previously developed iterated conditional expectations algorithm. Here we revisit it and redefine it in a message passing framework in a more general form. The results on three different benchmarks demonstrate that the proposed technique can perform well both for binary and multi-label MRFs without any limitations on the model definition. Furthermore, it manifests improved performance over related techniques either in terms of quality and/or speed

Depth video enhancement for 3D displays

At the current stage of technology, depth maps acquired using cameras based on a time-of-flight principle have much lower spatial resolution compared to images that are captured by conventional color cameras. The main idea of our work is to use high resolution color images to improve the spatial resolution and image quality of the depth maps

Sparse optical flow regularisation for real-time visual tracking

Optical flow can greatly improve the robustness of visual tracking algorithms. While dense optical flow algorithms have various applications, they can not be used for real-time solutions without resorting to GPU calculations. Furthermore, most optical flow algorithms fail in challenging lighting environments due to the violation of the brightness constraint. We propose a simple but effective iterative regularisation scheme for real-time, sparse optical flow algorithms, that is shown to be robust to sudden illumination changes and can handle large displacements. The algorithm proves to outperform well known techniques in real life video sequences, while being much faster to calculate. Our solution increases the robustness of a real-time particle filter based tracking application, consuming only a fraction of the available CPU power. Furthermore, a new and realistic optical flow dataset with annotated ground truth is created and made freely available for research purposes